cs . D S ] 1 7 Se p 20 06 CR - precis : A deterministic summary structure for update data streams

نویسنده

  • Anirban Majumder
چکیده

We present the CR-precis structure, that is a general-purpose, deterministic and sub-linear data structure for summarizing update data streams. The CR-precis structure yields the first deterministic sub-linear space/time algorithms for answering a variety of fundamental queries over update streams, such as, (a) point queries, (b) range queries, (c) finding approximate frequent items, (d) finding approximate quantiles, (e) finding approximate hierarchical heavy hitters, (f) estimating innerproducts, (g) near-optimal B-bucket histograms, etc..

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : c s / 06 09 03 2 v 1 [ cs . D S ] 7 S ep 2 00 6 CR - precis : A deterministic summary structure for update data streams

We present the CR-precis structure, that is a general-purpose, deterministic and sub-linear data structure for summarizing update data streams. The CR-precis structure yields the first deterministic sub-linear space/time algorithms for update streams for answering a variety of fundamental stream queries, such as, (a) point queries, (b) range queries, (c) finding approximate frequent items, (d) ...

متن کامل

CR-precis: A Deterministic Summary Structure for Update Data Streams

We present deterministic sub-linear space algorithms for problems over update data streams, including, estimating frequencies of items and ranges, finding approximate frequent items and approximate φ-quantiles, estimating inner-products, constructing near-optimal B-bucket histograms and estimating entropy. We also present improved lower bound results for several problems over update data streams.

متن کامل

A nearly optimal and deterministic summary structure for update data streams

We present a deterministic summary structure over update streams that enables deterministic and the first space-optimal algorithms for a variety of problems, including, estimating frequencies, finding approximate frequent items, finding approximate quantiles, finding hierarchical heavy hitters, approximately optimal B-bucket histograms, estimating inner product sizes, etc..

متن کامل

Non-linear Effects in Asymmetric Catalysis: Whys and Wherefores

It is argued that the titled non-linear effects (NLE) may arise whenever the order of the reaction in the chiral catalyst in greater than 1. In a fundamental departure from previous approaches, this is mathematically elaborated for the second order case. (NLE may also be observed if the chiral catalyst forms non-reacting dimers in a competing equilibrium; practically, however, this implies the ...

متن کامل

06 04 06 5 v 2 [ cs . D S ] 1 8 Se p 20 06 A new tractable combinatorial decomposition

This paper introduces the umodules, a generalisation of modules for the homogeneous relations. We first present some properties of the umodule family, then show that, if the homogeneous relation fulfills some natural axioms, the umodule family has a unique decomposition tree. We show that this tree can be computed in polynomial time, under a certain size assumption. We apply this theory to a ne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006